Improving Search Efficiency Using Bloom Filter in Partially Connected Ad Hoc Networks

We examine query based (QB) and Bloom filter based (BF) schemes for data retrieval in a partially connected ad hoc network. For the QB scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom filter and broadcasts it to the data querier, which sends a query only if the requested data is available. We derive the bandwidth utilization in the single neighbor scenario and search efficiency as a function of node density in the multiple neighbors scenario. Numerical results show that the BF scheme offers significant gain in search efficiency. Our performance evaluation makes use of the M/M/∞ queue to model mobility and is novel. It is useful for studying the impact of mobility in other mobile networks.